翻訳と辞書 Words near each other ・ Weapon Masters ・ Weapon mount ・ Weapon of Choice ・ Weapon of Choice (band) ・ Weapon of Choice (video game) ・ Weapon of mass destruction ・ Weapon P.R.I.M.E. ・ Weapon Plus ・ Weapon possession ・ Weapon storage area ・ Weapon system ・ Weapon System Safety ・ Weapon Systems Acquisition Reform Act of 2009 ・ Weapon systems of the Indian Navy ・ Weapon systems officer ・ Weapon target assignment problem ・ Weapon testing ・ Weapon X ・ Weapon X (disambiguation) ・ Weapon X (story arc) ・ Weapon Zero ・ Weapon's Amnesty ・ Weapon-class destroyer ・ Weaponeering ・ Weaponization of finance ・ Weaponlord ・ Weaponology ・ Weaponry (radio program) ・ Weaponry of the Australian Army ・ Weaponry of the Austro-Hungarian Empire Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Weapon target assignment problem ： ウィキペディア英語版 Weapon target assignment problem The weapon target assignment problem (WTA) is a class of combinatorial optimization problems present in the fields of optimization and operations research. It consists of finding an optimal assignment of a set of weapons of various types to a set of targets in order to maximize the total expected damage done to the opponent. The basic problem is as follows: :There are a number of weapons and a number of targets. The weapons are of type $i\; =\; 1,\; \backslash ldots,\; m$. There are $W\_$ available weapons of type $i$. Similarly, there are $j\; =\; 1,\; \backslash ldots,\; n$ targets, each with a value of $V\_$. Any of the weapons can be assigned to any target. Each weapon type has a certain probability of destroying each target, given by $p\_$. Notice that as opposed to the classic assignment problem or the generalized assignment problem, more than one agent (i.e., weapon) can be assigned to each ''task'' (i.e., target) and not all targets are required to have weapons assigned. Thus, we see that the WTA allows one to formulate optimal assignment problems wherein tasks require cooperation among agents. Additionally, it provides the ability to model probabilistic completion of tasks in addition to costs. Both static and dynamic versions of WTA can be considered. In the static case, the weapons are assigned to targets once. The dynamic case involves many rounds of assignment where the state of the system after each exchange of fire (round) is considered in the next round. While the majority of work has been done on the static WTA problem, recently the dynamic WTA problem has received more attention. In spite of the name, there are nonmilitary applications of the WTA. The main one is to search for a lost object or person by heterogeneous assets such as dogs, aircraft, walkers, etc. The problem is to assign the assets to a partition of the space in which the object is located to minimize the probability of not finding the object. The "value" of each element of the partition is the probability that the object is located there. ==Formal mathematical definition== The weapon target assignment problem is often formulated as the following nonlinear integer programming problem: :$\backslash min\; \backslash sum\_^n\; \backslash left\; (\; V\_\backslash prod\_^m\; q\_^^n\; x\_\backslash leq\; W\_i\; \backslash texti\; =\; 1,\; \backslash ldots,\; m,\; \backslash ,$ :$x\_\backslash ge\; 0\backslash texti\; =\; 1,\; \backslash ldots,\; m\; \backslash textj\; =\; 1,\; \backslash ldots,\; n.$ Where the variable $x\_$ represents the assignment of as many weapons of type $i$ to target $j$ and $q\_$ is the probability of survival ($1\; -\; p\_$). The first constraint requires that the number of weapons of each type assigned does not exceed the number available. The second constraint is the integral constraint. Notice that minimizing the expected survival value is the same as maximizing the expected damage. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Weapon target assignment problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.